Dynamic Cooperative Search for constraint satisfaction and combinatorial optimization : application to a rostering problem

نویسندگان

  • Boris Bontoux
  • Dominique Feillet
  • Christian Artigues
  • Eric Bourreau
چکیده

In this paper, we are interested in enumerative resolution methods for combinatorial optimization (COP) and constraint satisfaction problems (CSP). We introduce a new approch for the management of branching, called Dynamic Cooperative Search (DCS) inspired from the impact-based search method proposed in [7] for CSPs. This method defines in a dynamic way priority rules for variable and value selection in the branching scheme. These rules are meant to be independent of the considered problem. As in [7], the principle is to take into account, through learning methods, of the impact of branching decisions in already explored subparts of the search tree. We show the interest of DCS on a real-life rostering problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GENET and Tabu Search for Combinatorial Optimization Problems

Constraint satisfaction problems are combinatorial optimization problems which involve finding an assignment to a set of variables that is consistent with a set of constraints. In this paper the use of two local search techniques, namely GENET and Tabu Search for constraint satisfaction optimization problems and partial constraint satisfaction problems is investigated. These methods are compare...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

Dynamic Constraint Weighting for

Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be acceptable. Recent research has shown that constraint weighting local search algorithms can be very effective in solving a variety of CSPs. However, little work has been done in applying such algorithms to over-constrai...

متن کامل

Dynamic Constraint Weighting for Over-Constrained Problems

Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be acceptable. Recent research has shown that constraint weighting local search algorithms can be very effective in solving a variety of CSPs. However, little work has been done in applying such algorithms to over-constrai...

متن کامل

A novel approach to finding feasible solutions to personnel rostering problems

Classical meta-heuristic methods for solving rostering problems focus on defining measures of roster quality. Here we present a new case-based reasoning approach to generating repairs of hard constraint violations using expert-human experience. This approach is used to guide heuristic constraint satisfaction algorithms, eliminating the need to explicitly define search objectives.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007